Performance analysis of Jakimoski-Kocarev attack on a class of chaotic cryptosystems
نویسندگان
چکیده
Recently G. Jakimoski and L. Kocarev cryptanalzed two chaotic cryptosystems without using chaotic synchronization – Baptista cryptosystem and Alvarez cryptosystem. As a result, they pointed out that neither of the two cryptosystems are secure to known-plaintext attacks. In this letter, we re-study the performance of Jakimoski-Kocarev attack on Baptista cryptosystem and find that it is not efficient enough as a practical attack tool. Furthermore, a simple but effective remedy is presented to resist Jakimoski-Kocarev attack, and the detailed discussion on its performance are given.
منابع مشابه
Problems with a Probabilistic Encryption Scheme Based on Chaotic Systems
It has been well-known that tight relationship exists between chaos and cryptography [Brown & Chua, 1996]. Many fundamental characteristics of chaos, such as ergodicity, mixing property and sensitivity to initial conditions/control parameters [Hao, 1993], can be connected with some cryptographic properties of good ciphers, such as confusion/diffusion, balance and avalanche property [Schneier, 1...
متن کاملA Novel Approach for Designing Dynamical S-Boxes Using Hyperchaotic System
In the information security field, the substitution boxes (S-boxes) have been extensively used in many cryptographic systems. This paper presents a novel approach for generating dynamically cryptographically S-boxes using a four-dimensional hyperchaotic Lorenz system. Within the algorithm, the initial condition is employed to drive the hyper-chaotic system to generate a chaotic sequence which i...
متن کاملChaos and Pseudo-Randomness
We discuss the effect on finite machine implementation of chaotic system on randomness. We show that the most significant bit even for fully developed chaotic systems implemented with high precision (using 1000-bit arithmetics) is not random. We propose chaos-based pseudo-random bit generators and discuss their efficient software implementation.
متن کاملLogistic map as a block encryption algorithm
We discuss the relationship between cryptography and chaos theory, and similarities of their crucial concepts such as mixing property and sensitivity to changes in initial conditions and parameters. A systematic procedure for design of encryption algorithms based on chaotic maps is suggested. We present an example based on logistic map. 2001 Elsevier Science B.V. All rights reserved.
متن کاملSecurity of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and ...
متن کامل